Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective
نویسندگان
چکیده
The ability of a planner to modify a plan is considered as a valuable tool for improving ee-ciency of planning by avoiding the repetition of the same planning eeort. From a computational complexity point of view, however, it is by no means obvious that modifying a plan is com-putationally as easy as planning from scratch if the modiication has to follow the principle of \conservatism," i.e., to reuse as much of the old plan as possible. Indeed, considering proposi-tional STRIPS planning, it turns out that conservative plan modiication is as hard as planning and can sometimes be harder than plan generation. Furthermore, this holds even if we consider modiication problems where the old and the new goal speciication are similar. We put these results into perspective and discuss the relationship to existing plan modiication systems.
منابع مشابه
Plan Modiication versus Plan Generation: a Complexity-theoretic Perspective
The ability of a planner to modify a plan is considered as a valuable tool for improving ee-ciency of planning by avoiding the repetition of the same planning eeort. From a computational complexity point of view, however, it is by no means obvious that modifying a plan is computationally as easy as planning from scratch if the modiication has to follow the principle of \conservatism," i.e., to ...
متن کاملPlan Modi cation versus Plan Generation : A Complexity - Theoretic Perspective
The ability of a planner to modify a plan is considered as a valuable tool for improving ee-ciency of planning by avoiding the repetition of the same planning eeort. From a computational complexity point of view, however, it is by no means obvious that modifying a plan is com-putationally as easy as planning from scratch if the modiication has to follow the principle of \conservatism," i.e., to...
متن کاملSearch Control of Plan Generation in Decision-Theoretic Planners
This paper addresses the search control problem of selecting which plan to refine next for decision-theoretic planners, a choice point common to the decision theoretic planners created to date. Such planners can make use of a utility function to calculate bounds on the expected utility of an abstract plan. Three strategies for using these bounds to select the next plan to refine have been propo...
متن کاملCourse of Action Ontology for Counterinsurgency Operations
This paper presents the design and implementation of a course of action (COA) ontology for counterinsurgency (COIN) operations. This ontology supports the commander’s C2 decision making processes for COA design, analysis and selection and represents the key elements of the COA planning process; specifically measures-of-performance (MOP) and measures-of-effectiveness (MOE) for describing COA pla...
متن کاملPlan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis
The ability of a planner to reuse parts of old plans is hypothesized to be a valuable tool for improving eeciency of planning by avoiding the repetition of the same planning eeort. We test this hypothesis from an analytical and empirical point of view. A comparative worst-case complexity analysis of generation and reuse under diierent assumptions reveals that it is not possible to achieve a pro...
متن کامل